A multiobjective faculty–course–time slot assignment problem with preferences
نویسندگان
چکیده
منابع مشابه
A multiobjective faculty-course-time slot assignment problem with preferences
A faculty-course-time slot assignment problem is studied. The multiobjective 0-1 linear programming model considering both the administration’s and instructors’ preferences is developed and a demonstrative example is included. Both modeling and solving such problems are difficult tasks due to the size, the varied nature, and conflicting objectives of the problems. The difficulty increases becau...
متن کاملA note on the assignment problem with uniform preferences
Motivated by a problem of scheduling unit-length jobs with weak preferences over timeslots, the random assignment problem (also called the house allocation problem) is considered on a uniform preference domain. For the subdomain in which preferences are strict except possibly for the class of unacceptable objects, Bogomolnaia and Moulin characterized the probabilistic serial mechanism as the on...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملMultiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective problems, there are several twists on the conventional notions of fitness landscapes. Multiobjective optimization problems provide additional difficulties for those seeking to study the properties of the search space. Howe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2007
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2007.03.012